Modeling sequential information integration with parallel constraint satisfaction

نویسندگان

  • Katja Mehlhorn
  • Georg Jahn
چکیده

An important aspect of human cognition is the sequential integration of observations while striving for a consistent mental representation. Recent research consistently stresses the importance of fast automatic processes for integrating information available at a certain point in time. However, it is not clear, how such processes allow for maintaining a consistent and up to date mental representation in the light of new information. We compare variants of two methods of modeling sequential information integration with parallel constraint satisfaction models: carrying over results from the previous integration step or decaying input strength of older observations. Results of these models for consistent and inconsistent sets of observations are compared to human data from a diagnostic reasoning task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Parallelization for Constraint Satisfaction Search

This paper introduces two adaptive paradigms that parallelize search for solutions to constraint satisfaction problems. Both are intended for any sequential solver that uses contention-oriented variable-ordering heuristics and restart strategies. Empirical results demonstrate that both paradigms improve the search performance of an underlying sequential solver, and also solve challenging proble...

متن کامل

On the Parallel Complexity of Some Constraint Satisfaction Problems

Constraint satisfaction networks have been shown to be a very useful tool for knowledge representation in Artificial Intelligence applications. These networks often utilize local constraint propagation techniques to achieve global consistency (consistent labelling in vision). Such methods have been used extensively in the context of image understanding and interpretation, as well as planning, n...

متن کامل

Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation

Constraint satisfaction is very common in many arti cial intelligence applications. This paper presents results from parallelizing constraint satisfaction in a special application | the algorithm for qualitative simulation QSim [Kuipers 94]. A parallel-agent based strategy (PAB) is used to solve the constraint satisfaction problem (CSP). Two essential steps of PAB are studied in more detail to ...

متن کامل

Fast Parallel Constraint Satisfaction

Kirousis, L.M., Fast parallel constraint satisfaction (Research Note), Artificial Intelligence 64 (1993) 147-160. We describe a class of constraint satisfaction problems (CSPs) for which a global solution can be found by a fast parallel algorithm. No relaxation preprocessing is needed for the parallel algorithm to work on this class of CSPs. The result is motivated from the problem of labelling...

متن کامل

A hybrid evolutionary approach for solving constrained optimization problems over finite domains

A novel approach for the integration of evolution programs and constraint-solving techniques over finite domains is presented. This integration provides a problem-independent optimization strategy for large-scale constrained optimization problems over finite domains. In this approach, genetic operators are based on an arc-consistency algorithm, and chromosomes are arc-consistent portions of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009